Axioms for Knowledge and Time in Distributed Systems with Perfect Recall
نویسنده
چکیده
A distributed system, possibly asynchronous, is said to have perfect recall if at all times each processor's state includes a record of all its previous states. The completeness of a propositional modal logic of knowledge and time with respect to such systems is established. The logic includes modal operators for knowledge, and the temporal operators \next" and \until."
منابع مشابه
An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking
We present a variant of ATL with incomplete information which includes the distributed knowledge operators corresponding to synchronous action and perfect recall. The cooperation modalities assume the use the distributed knowledge of coalitions and accordingly refer to perfect recall incomplete information strategies. We propose a model-checking algorithm for the logic. It is based on technique...
متن کاملTableaux for Temporal Logics of Knowledge: Synchronous Systems of Perfect Recall or No Learning
The paper describes tableaux based proof methods for temporal logics of knowledge allowing interaction axioms between the modal and temporal components. Such logics can be used to specify systems that involve the knowledge of processes or agents and which change over time, for example agent based systems or knowledge games. The interaction axioms allow the description of how knowledge evolves o...
متن کاملClausal Resolution for Logics of Time and Knowledge with Synchrony and Perfect Recall
Temporal logics of knowledge are widely used in the specification and analysis of distributed and multi-agent systems where the behaviour of a component is captured by its set of possible executions. In spite of this, proof methods for these logics are rare, particularly in cases where the temporal and epistemic dimensions can interact. In this paper, we present a clausal resolution system for ...
متن کاملModel Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)
This paper studies model checking for the modal logic of knowledge and linear time in distributed systems with perfect recall. It is shown that this problem (1) is undecidable for a language with operators for until and common knowledge, (2) is PSPACE-complete for a language with common knowledge but without until, (3) has non-elementary upper and lower bounds for a language with until but with...
متن کاملArmstrong's Axioms and Navigation Strategies
The paper investigates navigability with imperfect information. It shows that the properties of navigability with perfect recall are exactly those captured by Armstrong’s axioms from database theory. If the assumption of perfect recall is omitted, then Armstrong’s transitivity axiom is not valid, but it can be replaced by a weaker principle. The main technical results are soundness and complete...
متن کامل